On the Tightness of an Optimization-Based Delay Bounding Method for Packet-Oriented Networks under Blind Multiplexing

Communication networks supporting real-time tasks need to guarantee timely delivery of critical data and commands. Worst-case delay performance of these networks can be analyzed using deterministic network calculus. In this report, we identify the discrepancy between existing bit-oriented delay bounding methods and packet-oriented behaviors of network devices. An optimization-based bit-oriented delay bounding method is then augmented for the more realistic packet-oriented settings. An example network is used to demonstrate how to formulate a packetoriented delay bounding problem using theorems for packet-based network devices. Finally, we show that the delay bounds obtained for the example packet-oriented network are theoretically tight under all possible network configurations.